منابع مشابه
On graphs isomorphic to their neighbour and non-neighbour sets
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood induce subgraphs isomorphic to the whole graph. This solves an open problem proposed by A. Bonato; see Problem 20 in [5]. We supply a construction of several non-isomorphic graphs with the property, and consider tourn...
متن کاملGood neighbour, bad neighbour: song sparrows retaliate against aggressive rivals
Good neighbour, bad neighbour: song sparrows retaliate against aggressive rivals Çağlar Akçay *, William E. Wood , William A. Searcy , Christopher N. Templeton , S. Elizabeth Campbell , Michael D. Beecher a,b,d Department of Psychology, University of Washington, Seattle, WA, U.S.A. Graduate Program in Neurobiology, University of Washington, Seattle, WA, U.S.A. Department of Biology, University ...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملNeighbour Lists Again
In a recent article, Thompson 1] described the use of neighbour lists in simulations, giving a detailed account of the implementation and the resulting economies. This note deals with a simple variant on the method, and discusses the choice of neighbour list technique, if any, to be used in various circumstances. The idea was originally introduced in the classic paper of Verlet 2] on the simula...
متن کاملRapid Neighbour-Joining
The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The criterion for which pair of nodes to merge is based on both the distance between the pair and the average distance to the rest of the nodes. In this paper, we present a new search strategy for the optimisation criteria used for selecting the next pair to merge and we show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hyperrhiz: New Media Cultures
سال: 2012
ISSN: 1555-9351
DOI: 10.20415/hyp/009.g02